Counterexample to Conjectured Su ( N ) Character Asymptotics Tatsuya Tate And
نویسندگان
چکیده
The purpose of this note is to give a counterexample to the conjectured large N asymptotics of character values χ R (U) of irreducible characters of SU (N), which appears in papers of Gross-Matytsin [M, GM] and Kazakov-Staudacher-Wynter [KW, KSW, KSW2, KSW3]). Asymptotics of characters are important in the large N limit of Y M 2 (2D Yang-Mills theory). Our counterexample consists of one special sequence of elements a N ∈ SU (N) for which the conjectured asymptotics on χ R N (a N) fail for any relevant sequence χ R N of irreducible characters. It is not clear at present how widespread in SU (N) the failure is. To state the conjecture and the counterexample, we will need some notation. We recall that irreducibles of SU (N) are parametrized by their highest weights λ or equivalently by Young diagrams with ≤ N − 1 rows. To facilitate comparison with [GM], we will use a further parametrization of representations R of SU (N) by their shifted highest weights = λ + ρ N , ρ N = half the sum of the positive roots. (1) The components of the shifted highest weight are then strictly decreasing ∞ > 1 > 2 > · · · > N > −∞ (cf. (13) for the explicit formula). To a shifted highest weight we associate the probability measure on R defined by
منابع مشابه
Counterexample to Conjectured Su(n) Character Asymptotics
The purpose of this note is to give a counterexample to the conjectured large N asymptotics of character values χR(U) of irreducible characters of SU(N), which appears in papers of Gross-Matytsin [M, GM] and Kazakov-Wynter [KW]. Asymptotics of characters are important in the large N limit in YM2 (2D Yang-Mills theory) and in certain matrix models [KSW, KSW2, KSW3]). Our counterexample consists ...
متن کاملLattice Path Combinatorics and Asymptotics of Multiplicities of Weights in Tensor Powers
We give asymptotic formulas for the multiplicities of weights and irreducible summands in high-tensor powers V ⊗N λ of an irreducible representation Vλ of a compact connected Lie group G. The weights are allowed to depend on N , and we obtain several regimes of pointwise asymptotics, ranging from a central limit region to a large deviations region. We use a complex steepest descent method that ...
متن کاملOn the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملAsymptotics of characters of symmetric groups: Structure of Kerov character polynomials
We study asymptotics of characters of the symmetric groups on a fixed conjugacy class. It was proved by Kerov that such a character can be expressed as a polynomial in free cumulants of the Young diagram (certain functionals describing the shape of the Young diagram). We show that for each genus there exists a universal symmetric polynomial which gives the coefficients of the part of Kerov char...
متن کاملA counterexample to Beck's conjecture on the discrepancy of three permutations
Given three permutations on the integers 1 through n, consider the set system consisting of each interval in each of the three permutations. József Beck conjectured (c. 1987) that the discrepancy of this set system is O(1). We give a counterexample to this conjecture: for any positive integer n = 3, we exhibit three permutations whose corresponding set system has discrepancy Ω(logn). Our counte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003